Low Ply Drawings of Trees

We consider the recently introduced model of \emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \emph{ply-disk} of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the \emph{ply-number} of the drawing. We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, even for stars, and that they may not even exist for bounded-degree trees. Then, we turn our attention to drawings with logarithmic ply-number and show that trees with maximum degree $6$ always admit such drawings in polynomial area.Comment: This is a complete access version of a paper that will appear in the proceedings of GD201

An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration

In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of developing efficient approaches to dynamic defragmentation and reallocation. One key aspect is to develop efficient algorithms and data structures that exploit the two-dimensional geometry of a chip, instead of just one. We propose a new method for this task, based on the fractal structure of a quadtree, which allows dynamic segmentation of the chip area, along with dynamically adjusting the necessary communication infrastructure. We describe a number of algorithmic aspects, and present different solutions. We also provide a number of basic simulations that indicate that the theoretical worst-case bound may be pessimistic.Comment: 11 pages, 12 figures; full version of extended abstract that appeared in ARCS 201

Engineering Art Galleries

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this survey, we describe this work, show the chronology of developments, and compare current algorithms, including two unpublished versions, in an exhaustive experiment. Furthermore, we show what core algorithmic ingredients have led to recent successes

3D Visibility Representations of 1-planar Graphs

We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility representation of G.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods

In an undirected graph $G$, a conflict-free coloring with respect to open neighborhoods (denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for a CFON coloring of $G$ is the CFON chromatic number of $G$, denoted by $\chi_{ON}(G)$. The decision problem that asks whether $\chi_{ON}(G) \leq k$ is NP-complete. We obtain the following results: * Bodlaender, Kolay and Pieterse [WADS 2019] showed the upper bound $\chi_{ON}(G)\leq {\sf fvs}(G)+3$, where ${\sf fvs}(G)$ denotes the size of a minimum feedback vertex set of $G$. We show the improved bound of $\chi_{ON}(G)\leq {\sf fvs}(G)+2$, which is tight, thereby answering an open question in the above paper. * We study the relation between $\chi_{ON}(G)$ and the pathwidth of the graph $G$, denoted ${\sf pw}(G)$. The above paper from WADS 2019 showed the upper bound $\chi_{ON}(G) \leq 2{\sf tw}(G)+1$ where ${\sf tw}(G)$ stands for the treewidth of $G$. This implies an upper bound of $\chi_{ON}(G) \leq 2{\sf pw}(G)+1$. We show an improved bound of $\chi_{ON}(G) \leq \lfloor \frac{5}{3}({\sf pw}(G)+1) \rfloor$. * We prove new bounds for $\chi_{ON}(G)$ with respect to the structural parameters neighborhood diversity and distance to cluster, improving existing results. * We also study the partial coloring variant of the CFON coloring problem, which allows vertices to be left uncolored. Let $\chi^*_{ON}(G)$ denote the minimum number of colors required to color $G$ as per this variant. Abel et. al. [SIDMA 2018] showed that $\chi^*_{ON}(G) \leq 8$ when $G$ is planar. They asked if fewer colors would suffice for planar graphs. We answer this question by showing that $\chi^*_{ON}(G) \leq 5$ for all planar $G$. All our bounds are a result of constructive algorithmic procedures.Comment: 30 page

Visibility Representations of Boxes in 2.5 Dimensions

We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis. We prove that: $(i)$ Every complete bipartite graph admits a 2.5D-BR; $(ii)$ The complete graph $K_n$ admits a 2.5D-BR if and only if $n \leq 19$; $(iii)$ Every graph with pathwidth at most $7$ admits a 2.5D-BR, which can be computed in linear time. We then turn our attention to 2.5D grid box representations (2.5D-GBR) which are 2.5D-BRs such that the bottom face of every box is a unit square at integer coordinates. We show that an $n$-vertex graph that admits a 2.5D-GBR has at most $4n - 6 \sqrt{n}$ edges and this bound is tight. Finally, we prove that deciding whether a given graph $G$ admits a 2.5D-GBR with a given footprint is NP-complete. The footprint of a 2.5D-BR $\Gamma$ is the set of bottom faces of the boxes in $\Gamma$.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Whey protein lowers systolic blood pressure and Ca-caseinate reduces serum TAG after a high-fat meal in mildly hypertensive adults

Epidemiological studies show an inverse association between dairy consumption and blood pressure (BP) but there are few data on the postprandial effects of milk proteins. This study examined their effects, compared to maltodextrin, on postprandial BP and other CVD risk markers in volunteers with mild and pre-hypertension over an 8 h period. In this double-blinded, randomised, cross-over, controlled study 27 adults ingested a high-fat, isoenergetic breakfast and lunch with 28 g whey protein, 28 g Ca-caseinate or 27 g maltodextrin. Whey protein reduced systolic BP compared with Ca-caseinate (−15.2 ± 13.6 mmHg) and maltodextrin (−23.4 ± 10.5 mmHg) up to 5 h post-ingestion. There was an improvement in arterial stiffness after whey protein compared with maltodextrin (incremental Area Under the Curve- iAUC0–8h: +14.4 ± 6.2%). Despite similar glucose levels after both whey protein and Ca-caseinate, whey protein induced a higher insulin response than Cacaseinate (iAUC0–8h: +219.5 ± 54.6 pmol/L). Ca-caseinate induced less suppression of non-esterified fatty acids than whey protein (iAUC0–5h: −58.9 ± 135.5 μmol/L) and maltodextrin (iAUC0–5h: −106.9 ± 89.4 μmol/L) and induced a smaller postprandial triacylglycerol response than whey protein (iAUC0–8h: −1.68 ± 0.6 mmol/L). Milk proteins co-ingestion with high-fat meals may have the potential to maintain or improve CVD risk factors

Genomic analysis of the function of the transcription factor gata3 during development of the Mammalian inner ear

We have studied the function of the zinc finger transcription factor gata3 in auditory system development by analysing temporal profiles of gene expression during differentiation of conditionally immortal cell lines derived to model specific auditory cell types and developmental stages. We tested and applied a novel probabilistic method called the gamma Model for Oligonucleotide Signals to analyse hybridization signals from Affymetrix oligonucleotide arrays. Expression levels estimated by this method correlated closely (p<0.0001) across a 10-fold range with those measured by quantitative RT-PCR for a sample of 61 different genes. In an unbiased list of 26 genes whose temporal profiles clustered most closely with that of gata3 in all cell lines, 10 were linked to Insulin-like Growth Factor signalling, including the serine/threonine kinase Akt/PKB. Knock-down of gata3 in vitro was associated with a decrease in expression of genes linked to IGF-signalling, including IGF1, IGF2 and several IGF-binding proteins. It also led to a small decrease in protein levels of the serine-threonine kinase Akt2/PKB beta, a dramatic increase in Akt1/PKB alpha protein and relocation of Akt1/PKB alpha from the nucleus to the cytoplasm. The cyclin-dependent kinase inhibitor p27(kip1), a known target of PKB/Akt, simultaneously decreased. In heterozygous gata3 null mice the expression of gata3 correlated with high levels of activated Akt/PKB. This functional relationship could explain the diverse function of gata3 during development, the hearing loss associated with gata3 heterozygous null mice and the broader symptoms of human patients with Hearing-Deafness-Renal anomaly syndrome

Análise física e morfológica do efeito de diferentes concentrações de adesivo no recobrimento de sementes de capim ramirez (Paspalum guenoarum).

O objetivo deste trabalho foi avaliar a eficiência do recobrimento nas sementes de Paspalum guenoarum, utilizando diferentes concentrações de adesivo, a fim de melhorar a qualidade das sementes e tornar mais viável sua utilização.CIC

Acute kidney injury in children

Acute kidney injury (AKI) (previously called acute renal failure) is characterized by a reversible increase in the blood concentration of creatinine and nitrogenous waste products and by the inability of the kidney to regulate fluid and electrolyte homeostasis appropriately. The incidence of AKI in children appears to be increasing, and the etiology of AKI over the past decades has shifted from primary renal disease to multifactorial causes, particularly in hospitalized children. Genetic factors may predispose some children to AKI. Renal injury can be divided into pre-renal failure, intrinsic renal disease including vascular insults, and obstructive uropathies. The pathophysiology of hypoxia/ischemia-induced AKI is not well understood, but significant progress in elucidating the cellular, biochemical and molecular events has been made over the past several years. The history, physical examination, and laboratory studies, including urinalysis and radiographic studies, can establish the likely cause(s) of AKI. Many interventions such as ‘renal-dose dopamine’ and diuretic therapy have been shown not to alter the course of AKI. The prognosis of AKI is highly dependent on the underlying etiology of the AKI. Children who have suffered AKI from any cause are at risk for late development of kidney disease several years after the initial insult. Therapeutic interventions in AKI have been largely disappointing, likely due to the complex nature of the pathophysiology of AKI, the fact that the serum creatinine concentration is an insensitive measure of kidney function, and because of co-morbid factors in treated patients. Improved understanding of the pathophysiology of AKI, early biomarkers of AKI, and better classification of AKI are needed for the development of successful therapeutic strategies for the treatment of AKI